Exploiting Spatial Locality to Improve Peer-to-Peer System Performance

نویسندگان

  • Zhiyong Xu
  • Yiming Hu
چکیده

Routing performance is critical for Peer-to-Peer (P2P) systems to achieve high performance. Current routing algorithms concentrate on creating a well organized network architecture to boost routing performance. However, for each routing procedure, system returns location information of the requested file only and the characteristics of system workload are seldom considered. In this paper, we propose UCP2P routing algorithm which introduces “superobject” to take advantage of spatial locality among file accesses. When a client retrieves a file, UCP2P routing algorithm may send location information of several other correlated files in addition within one routing procedure. No further routing procedure is needed if the client requests any of these files later. By this mechanism, we can greatly reduce the routing overhead. Our preliminary simulation results show UCP2P achieves a great routing performance improvement over the previous algorithms.

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Content Location in Peer-to-peer Systems: Exploiting Locality

Efficient content location is a fundamental problem for decentralized peer-to-peer systems. Gnutella, a popular file-sharing application, relies on flooding queries to all peers. Although flooding is simple and robust, it is not scalable. In this chapter, we explore how to retain the simplicity of Gnutella while addressing its inherent weakness: scalability. We propose two complementary content...

متن کامل

Exploiting network proximity in peer-to-peer overlay networks

Generic peer-to-peer (p2p) overlay networks like CAN, Chord, Pastry and Tapestry offer a novel platform for a variety of scalable and decentralized distributed applications. These systems provide efficient and fault-tolerant routing, object location and load balancing within a self-organizing overlay network. One important aspect of these systems is how they exploit network proximity in the und...

متن کامل

Using Proximity Measure to Improve Locality in Structured P2P Networks

Peer-to-peer networks are generally characterized in terms of sharing computer resources without the intermediation of a centralized server. Interconnected nodes in peer-to-peer networks are able to communicate through a self organizing topology which runs as an overlay on top of the physical network. The mismatch problem between underlay and overlay network in such systems, known as locality p...

متن کامل

Plethora: A Locality Enhancing Peer-to-Peer Network

Distributed hash tables (DHTs), used in a number of structured peer-to-peer systems provide efficient mechanisms for resource location. A key distinguishing feature of current DHT systems like Chord [15], Pastry [12], and Tapestry [19] is the way they handle locality in the underlying network. Topology-based node identifier assignment, proximity routing, and proximity neighbor selection are exa...

متن کامل

A Scalable Method for Taking Detailed and Accurate Geo* Snapshots of Large P2P Networks

Peer-to-peer file-sharing systems offer high transfer speed at remarkably low data ownership cost. In many cases, the transfer speed can be increased if the users possess timely and accurate information over the location of other users. Furthermore, robustness and fault tolerance, issues of intense research investigation, are inextricably linked with the location and activity of the network use...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2003